On the inclusion chromatic index of a graph
نویسندگان
چکیده
منابع مشابه
The b-chromatic index of a graph
The b-chromatic index φ(G) of a graph G is the largest integer k such that G admits a proper k-edge coloring in which every color class contains at least one edge incident to some edge in all the other color classes. The b-chromatic index of trees is determined and equals either to a natural upper bound m(T ) or one less, where m(T ) is connected with the number of edges of high degree. Some co...
متن کاملOn Strong Chromatic Index of Halin Graph
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consisting of a tree with no vertex of degree tw...
متن کاملInjective Edge Chromatic Index of a Graph
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph G = (V,E) is a coloring c of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then c(e1) 6= c(e3). The injective edge coloring number χ ′ i(G) is the minimum number of colors permitted in such a coloring. In this paper,...
متن کاملThe annihilator-inclusion Ideal graph of a commutative ring
Let R be a commutative ring with non-zero identity. The annihilator-inclusion ideal graph of R , denoted by ξR, is a graph whose vertex set is the of allnon-zero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacentif and only if either Ann(I) ⊆ J or Ann(J) ⊆ I. In this paper, we investigate the basicproperties of the graph ξR. In particular, we showthat ξR is a connected grap...
متن کاملComplexity of determining the irregular chromatic index of a graph
A graph G is locally irregular if adjacent vertices of G have different degrees. A k-edge colouring φ of G is locally irregular if each of the k colours of φ induces a locally irregular subgraph of G. The irregular chromatic index χirr(G) of G is the least number of colours used by a locally irregular edge colouring ofG (if any). We show that determining whether χirr(G) = 2 is NP-complete, even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22636